Malicious User Detection Based on Low-Rank Matrix Completion in Wideband Spectrum Sensing
نویسندگان
چکیده
منابع مشابه
Low-Rank Matrix Completion
While datasets are frequently represented as matrices, real-word data is imperfect and entries are often missing. In many cases, the data are very sparse and the matrix must be filled in before any subsequent work can be done. This optimization problem, known as matrix completion, can be made well-defined by assuming the matrix to be low rank. The resulting rank-minimization problem is NP-hard,...
متن کاملCompressive Wideband Spectrum Sensing based on Cyclostationary Detection
Cognitive Radios (CRs) operating in a wideband channel must detect the presence of licensed users within a constrained sensing time, and under energy limitations. In this paper, we explore a reduced-complexity compressive sampling cyclostationary detection method which exploits the sparsity of the two-dimensional spectral correlation function (SCF). We obtain a closed-form expression that recon...
متن کاملOrthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
In this paper, we propose an efficient and scalable low rank matrix completion algorithm. The key idea is to extend orthogonal matching pursuit method from the vector case to the matrix case. We further propose an economic version of our algorithm by introducing a novel weight updating rule to reduce the time and storage complexity. Both versions are computationally inexpensive for each matrix ...
متن کاملLow-Rank Matrix Completion by Riemannian Optimization
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a novel algorithm for matrix completion that minimizes the least square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical non-linear conjugate gradients, developed within the framework o...
متن کاملDecomposition Approach for Low-rank Matrix Completion
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank completed matrix. The divide-and-conquer approach can significantly reduce computation complexity and storage requirement. Moreover, the proposed decomposition m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2018
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2759082